Inseparability in recursive copies

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Possible Degrees in Recursive Copies

Let A be a recursive structure, and let R be a recursive relation on A. Harizanov ( 1991) isolated a syntactical condition which (with additional effectiveness conditions) is necessary and sufficient for A to have recursive copies in which the image of R is r.e. of arbitrary te. degree. We had conjectured that a certain extension of Harizanov’s syntactical condition would (with some effectivene...

متن کامل

Eeectivizing Inseparability

Smullyan's notion of eeectively inseparable pairs of sets is not the best eeec-tive/constructive analog of Kleene's notion of pairs of sets inseparable by a recursive set. We present a corrected notion of eeectively inseparable pairs of sets, prove a characterization of our notion, and show that the pairs of index sets eeectively inseparable in Smullyan's sense are the same as those eeectively ...

متن کامل

Quantum Nonlocality and Inseparability

wK = 1. A necessary condition for separability is derived and is shown to be more sensitive than Bell’s inequality for detecting quantum inseparability. Moreover, collective tests of Bell’s inequality (namely, tests that involve several composite systems simultaneously) may sometimes lead to a violation of Bell’s inequality, even if the latter is satisfied when each composite system is tested s...

متن کامل

Query Inseparability by Games

We investigate conjunctive query inseparability of description logic knowledge bases (KBs) with respect to a given signature, a fundamental problem for KB versioning, module extraction, forgetting and knowledge exchange. We develop a game-theoretic technique for checking query inseparability of KBs expressed in fragments of Horn-ALCHI, and show a number of complexity results ranging from P to E...

متن کامل

Adjacency, Inseparability, and Base Orderability in Matroids

Two elements in an oriented matroid are inseparable if they have either the same sign in every signed circuit containing them both or opposite signs in every signed circuit containing them both. Two elements of a matroid are adjacent if there is no M(K4)-minor using them both, and in which they correspond to a matching of K4. We prove that two elements e, { of an oriented matroid are inseparabl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1994

ISSN: 0168-0072

DOI: 10.1016/0168-0072(94)90046-9